Probabilistic covering problems
نویسنده
چکیده
منابع مشابه
توسعه مدل مکان یابی-تخصیص حداکثر پوشش با امکان ایجاد ازدحام در محیط رقابتی مبتنی بر انتخاب مشتری
The main objective of facilities location and service system design is covering of potential customers’ demand. Many location models are extended with the covering objective and considered constraints, details of problem and its different aspects. In this paper the maximal covering location-allocation model for congested system is extended in the competitive environment. In the proposed model, ...
متن کاملSet Covering and Network Optimization: Dynamic and Approximation Algorithms
In this short note we summarize our results on development and analysis of approximation and dynamic algorithms for set covering and network optimization problems. The results include probabilistic analysis of set covering algorithms, development and analysis of dynamic algorithms for graph optimization problems, game-theoretic analysis of a file-sharing network model, and approximation algorit...
متن کاملImproved handling of uncertainty and robustness in set covering problems
This paper studies the emergency service facility location problem in an uncertain environment. The main focus is the integration of uncertainty regarding the covered area due to uncertain traveling times. Previous approaches only consider either probabilistic or fuzzy optimization to cope with uncertainty. However, in many real-world problems the required statistical parameters are not precise...
متن کاملProbabilistic Set Covering with Correlations
We consider a probabilistic set covering problem where there is uncertainty regarding whether a selected set can cover an item, and the objective is to determine a minimum-cost combination of sets so that each item is covered with a pre-specified probability. To date, literature on this problem has focused on the special case in which uncertainties are independent. In this paper, we formulate c...
متن کاملRandomized Rounding without Solving the Linear Program 33
We introduce a new technique called oblivious rounding | a variant of randomized rounding that avoids the bottleneck of rst solving the linear program. Avoiding this bottleneck yields more eecient algorithms and brings probabilistic methods to bear on a new class of problems. We give oblivious rounding algorithms that approximately solve general packing and covering problems, including a parall...
متن کامل